A BI-OBJECTIVE MULTIPERIOD ONE-DIMENSIONAL CUTTING STOCK PROBLEM

In this paper, we investigate the bi-objective multiperiod one-dimensional cutting stock problem that seeks to minimize cost of production associated with total length cut objects (waste) and inventory costs related items. A mathematical model is presented heuristically solved by a column generation method. Computational tests were performed using Weighted Sum method, ε-Constraint method variation Benson The Pearson correlation coefficient was calculated in order trade-off between conflicting objectives problem. results confirmed strong negative objective functions All applied scalar methods able find multiple efficient solutions for reasonable computational time; however, modified better.